Attainable lengths for circular binary words avoiding $k$ powers
نویسندگان
چکیده
منابع مشابه
Avoiding Abelian Powers in Binary Words with Bounded Abelian Complexity
The notion of Abelian complexity of infinite words was recently used by the three last authors to investigate various Abelian properties of words. In particular, using van der Waerden’s theorem, they proved that if a word avoids Abelian k-powers for some integer k, then its Abelian complexity is unbounded. This suggests the following question: How frequently do Abelian k-powers occur in a word ...
متن کاملOn shortest crucial words avoiding abelian powers
Let k ≥ 2 be an integer. An abelian k-th power is a word of the form X1X2 · · ·Xk where Xi is a permutation of X1 for 2 ≤ i ≤ k. A word W is said to be crucial with respect abelian k-th powers if W avoids abelian k-th powers, but Wx ends with an abelian k-th power for any letter x occurring in W . Evdokimov and Kitaev [2] have shown that the shortest length of a crucial word on n letters avoidi...
متن کاملFixed points avoiding Abelian k-powers
We show that the problem of whether the fixed point of a morphism avoids Abelian k-powers is decidable under rather general conditions.
متن کاملParity Index of Binary Words and Powers of Prime Words
Let f be a binary word and let Fd(f) be the set of words of length d which do not contain f as a factor (alias words that avoid the pattern f). A word is called even/odd if it contains an even/odd number of 1s. The parity index of f (of dimension d) is introduced as the difference between the number of even words and the number of odd words in Fd(f). A word f is called prime if every nontrivial...
متن کاملCounting Binary Words Avoiding Alternating Patterns
Let F [p] denote the set of binary words, with no more 0’s than 1’s, that do not contain the pattern p = (10)1 as a factor for any fixed j ≥ 1. We give the generating function for the integer sequence enumerating, according to the number of 1’s, the words in F [p].
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the Belgian Mathematical Society - Simon Stevin
سال: 2005
ISSN: 1370-1444
DOI: 10.36045/bbms/1133793340